Urban surface reconstruction in SAR tomography by graph-cuts
نویسندگان
چکیده
منابع مشابه
Automatic urban modeling using volumetric reconstruction with surface graph cuts
The demand for 3D city-scale models has been significantly increased due to the proliferation of urban planning, city navigation, and virtual reality applications. We present an approach to automatically reconstruct buildings densely spanning a large urban area. Our method takes as input calibrated aerial images and available GIS meta-data. Our computational pipeline computes a per-building 2.5...
متن کامل3D Surface Reconstruction Using Graph Cuts with Surface Constraints
We describe a graph cut algorithm to recover the 3D object surface using both silhouette and foreground color information. The graph cut algorithm is used for optimization on a color consistency field. Constraints are added to improve its performance. These constraints are a set of predetermined locations that the true surface of the object is likely to pass through. They are used to preserve p...
متن کاملRobust Surface Reconstruction from Noisy Point Clouds using Graph Cuts
This work is concerned with the implementation and evaluation of a surface reconstruction approach, which is highly robust against outliers. The chosen approach has a range of appealing properties. First of all, it manages to incorporate a keypoint-based visibility constraint, which leads to a very high resilience to outliers. Secondly, it is based on a Delaunay triangulation, which makes the a...
متن کاملMulti-camera Scene Reconstruction via Graph Cuts
We address the problem of computing the 3-dimensional shape of an arbitrary scene from a set of images taken at known viewpoints. Multi-camera scene reconstruction is a natural generalization of the stereo matching problem. However, it is much more difficult than stereo, primarily due to the difficulty of reasoning about visibility. In this paper, we take an approach that has yielded excellent ...
متن کاملCarotid Artery Wall Segmentation by Coupled Surface Graph Cuts
We present a three-dimensional coupled surface graph cut algorithm for carotid wall segmentation from Magnetic Resonance Imaging (MRI). Using cost functions that highlight both inner and outer vessel wall borders, the method combines the search for both borders into a single graph cut. Our approach requires little user interaction and can robustly segment the bifurcation section of the carotid ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer Vision and Image Understanding
سال: 2019
ISSN: 1077-3142
DOI: 10.1016/j.cviu.2019.07.011